Probabilistic Analysis of Tree Search
نویسنده
چکیده
Consider the family tree of an age-dependent branching process, where the branches have costs corresponding to birth times. The first-birth problem of Hammersley (1974) then concerns the cost of an optimal (cheapest) node at depth n. Suppose that we must explore the tree so as to find an optimal or nearly optimal node at depth n. We now have a suitable model for analysing the behaviour of tree search algorithms, and we may extend the investigations of Karp and Pearl (1983).
منابع مشابه
Probabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملDESIGN OF MINIMUM SEEPAGE LOSS IRRIGATION CANAL SECTIONS USING PROBABILISTIC SEARCH
To ensure efficient performance of irrigation canals, the losses from the canals need to be minimized. In this paper a modified formulation is presented to solve the optimization model for the design of different canal geometries for minimum seepage loss, in meta-heuristic environment. The complex non-linear and non-convex optimization model for canal design is solved using a probabilistic sear...
متن کاملProbabilistic Power Distribution Planning Using Multi-Objective Harmony Search Algorithm
In this paper, power distribution planning (PDP) considering distributed generators (DGs) is investigated as a dynamic multi-objective optimization problem. Moreover, Monte Carlo simulation (MCS) is applied to handle the uncertainty in electricity price and load demand. In the proposed model, investment and operation costs, losses and purchased power from the main grid are incorporated in the f...
متن کاملAn analysis of breadth-first beam search using uniform cost trees
In this paper, we present a probabilistic analysis of breadthfirst beam search on trees. The work is divided into two parts. First, we introduce a ranking model to characterize the nodes in a search space and discuss the condition for provable optimality of beam search in terms of the ranking model. We also formulate a method to compute the probability of optimal termination of beam search for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990